NUMERICAL APPROXIMATION OF OSCILLATORY INITIAL VALUE PROBLEMS USING THE HOMOTOPY ANALYSIS ALGORITHM
نویسندگان
چکیده
In this paper, we present numerical approximation for oscillatory initial value problems (IVPs) using the homotopy analysis algorithm. The convergence of method is discussed and experiments are presented to illustrate computational effectiveness results obtained in good agreement with exact solutions Adomian decomposition (ADM). These show that algorithm introduced here easy apply without linearization.
منابع مشابه
Trigonometrically fitted two-step obrechkoff methods for the numerical solution of periodic initial value problems
In this paper, we present a new two-step trigonometrically fitted symmetric Obrechkoff method. The method is based on the symmetric two-step Obrechkoff method, with eighth algebraic order, high phase-lag order and is constructed to solve IVPs with periodic solutions such as orbital problems. We compare the new method to some recently constructed optimized methods from the literature. The numeri...
متن کاملSome numerical algorithms for solving the highly oscillatory second-order initial value problems
Article history: Received 9 January 2014 Received in revised form 16 May 2014 Accepted 15 July 2014 Available online 28 July 2014
متن کاملStiffness in numerical initial-value problems
This paper reviews various aspects of stiffness in the numerical solution of initial-value problems for systems of ordinary differential equations. In the literature on numerical methods for solving initial value problems the term "stiff" has been used by various authors with quite different meanings, which often causes confusion. This paper attempts to clear up this confusion by reviewing some...
متن کاملNumerical Methods for Fuzzy Initial Value Problems
In this paper, fuzzy initial value problems for modelling aspects of uncertainty in dynam ical systems are introduced and interpreted from a probabilistic point ofview. Due to the uncertainty incorporated in the model, the behavior of dynamical systems modelIed in this way will generally not be unique. Rather, we obtain a large set of trajectories which are more or less compatible with the des...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fudma Journal of Sciences
سال: 2023
ISSN: ['2616-1370']
DOI: https://doi.org/10.33003/fjs-2023-0702-1743